Power up! Robust Graph Convolutional Network via Graph Powering
نویسندگان
چکیده
Graph convolutional networks (GCNs) are powerful tools for graph-structured data. However, they have been recently shown to be vulnerable topological attacks. To enhance adversarial robustness, we go beyond spectral graph theory robust theory. By challenging the classical Laplacian, propose a new convolution operator that is provably in domain and incorporated GCN architecture improve expressivity interpretability. extending original sequence of graphs, also training paradigm encourages transferability across graphs span range spatial characteristics. The proposed approaches demonstrated extensive experiments simultaneously performance both benign situations.
منابع مشابه
Graph Based Convolutional Neural Network
In this paper we present a method for the application of Convolutional Neural Network (CNN) operators for use in domains which exhibit irregular spatial geometry by use of the spectral domain of a graph Laplacian, Figure 1. This allows learning of localized features in irregular domains by defining neighborhood relationships as edge weights between vertices in graph G. By formulating the domain...
متن کاملTensor graph convolutional neural network
In this paper, we propose a novel tensor graph convolutional neural network (TGCNN) to conduct convolution on factorizable graphs, for which here two types of problems are focused, one is sequential dynamic graphs and the other is cross-attribute graphs. Especially, we propose a graph preserving layer to memorize salient nodes of those factorized subgraphs, i.e. cross graph convolution and grap...
متن کاملLearning Graph While Training: An Evolving Graph Convolutional Neural Network
Convolution Neural Networks on Graphs are important generalization and extension of classical CNNs. While previous works generally assumed that the graph structures of samples are regular with unified dimensions, in many applications, they are highly diverse or even not well defined. Under some circumstances, e.g. chemical molecular data, clustering or coarsening for simplifying the graphs is h...
متن کاملGraph Convolutional Neural Networks via Scattering
We generalize the scattering transform to graphs and consequently construct a convolutional neural network on graphs. We show that under certain conditions, any feature generated by such a network is approximately invariant to permutations and stable to graph manipulations. Numerical results demonstrate competitive performance on relevant datasets.
متن کاملSome Graph Polynomials of the Power Graph and its Supergraphs
In this paper, exact formulas for the dependence, independence, vertex cover and clique polynomials of the power graph and its supergraphs for certain finite groups are presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2021
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v35i9.16976